ScottyActivity: Mixed Discrete-Continuous Planning with Convex Optimization
نویسندگان
چکیده
منابع مشابه
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl+, showing that the language makes convenient the modelling of complex timedependent effects. We provide a formal semantics for pddl+ by mapping planning instances into constructs of hybrid automata. Using the syntax o...
متن کاملPlanning for Mixed Discrete Continuous Domains
Mixed discrete-continuous systems are hybrid systems that exhibit both discrete changes of state, describable in terms of their logical and metric properties, and continuous numeric change describable in terms of differential equations. Continuous change occurs within a state as a consequence of one or more continuous processes being active in that state, whilst discrete change results in state...
متن کاملMixed Discrete-Continuous Heuristic Generative Planning Based on Flow Tubes
Nowadays, robots are programmed with a mix of discrete and continuous low level behaviors by experts in a very time consuming and expensive process. Existing automated planning approaches are either based on hybrid model predictive control techniques, which do not scale well due to time discretization, or temporal planners, which sacrifice plan expressivity by only supporting discretized fixed ...
متن کاملConvex Discrete Optimization
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer programming problems in variable dimension. We discuss some of the many applications of this theory including to quadratic prog...
متن کاملEstimation Distribution Algorithm for mixed continuous-discrete optimization problems
In recent few years expressive progress in the theory and practice of Estimation of Distribution Algorithms (EDA) [1] has appeared, where the classical genetic recombination operators are replaced by probability estimation and stochastic sampling techniques. In this paper we identify some disadvantages of present probabilistic models used in EDAs and propose more general and efficient model for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2018
ISSN: 1076-9757
DOI: 10.1613/jair.1.11219